Efficient Method for Parallel Computation of Geodesic Transformation on CPU
نویسندگان
چکیده
منابع مشابه
Computation-Efficient Parallel Prefix
We are interested in solving the prefix problem of n inputs using p < n processors on completely connected distributed-memory multicomputers (CCDMMs). This paper improves a previous work in three respects. First, the communication time of the previous algorithm is reduced significantly. Second, we show that p(p + 1)/2 < n is required for the new algorithm and the original one to be applicable. ...
متن کاملGeodesic Computation on Implicit Surfaces
Geodesics have a wide range of applications in CAD, shape design and machine learning. Current research on geodesic computation focuses primarily on parametric surfaces and mesh representations. There is little work on implicit surfaces. In this paper, we present a novel algorithm able to compute the exact geodesics on implicit surfaces. Although the existing Fast Marching Method can generate a...
متن کاملEfficient Parallel Computation of PageRank
PageRank inherently is massively parallelizable and distributable, as a result of web’s strict host-based link locality. We show that the Gauß-Seidel iterative method can actually be applied in such a parallel ranking scenario in order to improve convergence. By introducing a two-dimensional web model and by adapting the PageRank to this environment, we present efficient methods to compute the ...
متن کاملParallel computation framework for optimizing trailer routes in bulk transportation
We consider a rich tanker trailer routing problem with stochastic transit times for chemicals and liquid bulk orders. A typical route of the tanker trailer comprises of sourcing a cleaned and prepped trailer from a pre-wash location, pickup and delivery of chemical orders, cleaning the tanker trailer at a post-wash location after order delivery and prepping for the next order. Unlike traditiona...
متن کاملGeodesic Computation for Adaptive Remeshing
This video presents an application of geodesic computation on 3D meshes to surface remeshing. The farthest point paradigm [1] is a powerful greedy algorithm that allows fast and accurate sampling of the underlying surface. The use of a varying speed function for front propagation enables an adaptive placement of the seed points. The connectivity of the resulting mesh is computed using a geodesi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Parallel and Distributed Systems
سال: 2020
ISSN: 1045-9219,1558-2183,2161-9883
DOI: 10.1109/tpds.2019.2953057